An algorithm for computing the rst homology groups of CDGAs with linear di erential
نویسنده
چکیده
We design here a primary platform for computing the basic homological information of Commutative Di erential Graded Algebras (brie y, CDGAs), endowed with linear di erential. All the algorithms have been implemented in the framework settled by Mathematica, so that we can take advantage of the use of symbolic computation and many other powerful tools this system provides. Working in the context of CDGAs, Homological Perturbation Theory ([8], [9],[17]) supplies immediately a general algorithm computing the 1-homology of these objects at graded module level. But this process, already sketched by Lambe in [12], often bears high computational charges and actually restricts its application to the low dimensional homological calculus. Although we already know the work of Lambe on Axiom (earlier known as \Scratchpad", [11],[13]), our goal is to implement new functions on Mathematica, starting from the theoretical approach settled in [2]. This paper is devoted to design and analyze a particular Mathematica \package" for computing the basic homological information of CDGAs endowed with linear di erential. What we do here, indeed, is to compute the di erential operator and not the homology itself, actually. The full homological information may be reached by only applying Veblen's algorithm (see [19]). In this sense, it may be an Partially supported by PAICYT n. FQM-0143, Spain 2Partially supported by project DGYCI n. PB97-1025-C02-02, Spain 3 Supported by a grant from the Junta de Andaluc a Preprint submitted to IMS'99 27 August 1999 interesting e ort to implement a routine for computing the Smith normal form of a given matrix, which was not our goal here. Nevertheless, homological information is available by knowing the di erential operator. All the functions and formulas below may be implemented in di erent notebooks, so that each of them can be independently executed. The paper is organized as follows. In Section 1, we give some preliminaries of Di erential Homological Algebra. This section is just necessary for getting a basic knowledge about what a homological model of a CDGA is, and how to compute its homology groups. Sections 2 to 8 are devoted to construct the seven elemental functions which lead to de ne the di erential operator on the homological model. From this data, we may de ne the function computing that di erential operator, in the same way it is done in [1]. Last section includes the full code of the programme.
منابع مشابه
Numerical Solution of fuzzy differential equations of nth-order by Adams-Bashforth method
So far, many methods have been presented to solve the rst-order di erential equations. But, not many studies have been conducted for numerical solution of high-order fuzzy di erential equations. In this research, First, the equation by reducing time, we transform the rst-order equation. Then we have applied Adams-Bashforth multi-step methods for the initial approximation of one order di erentia...
متن کاملRational Heuristics for Rational Solutions of Riccati Equations
We describe some new algorithm and heuristics for computing the polynomial and rational solutions of bounded degree of a class of ordinary di erential equations, which includes generalized Riccati equations. As a consequence, our methods can be used for factoring linear ordinary di erential equations. Since they generate systems of algebraic equations in at most n unknowns, where n is the order...
متن کاملDiierential Elimination-completion Algorithms for Dae and Pdae
dae and pdae are systems of ordinary and partial di erential-algebraic equations with constraints. They occur frequently in applications such as constrained multibody mechanics, space-craft control and incompressible uid dynamics. A dae has di erential index r if a minimum of r+1 di erentiations of it are required before no new constraints are obtained. While dae of low di erential index (0 or ...
متن کاملAn introduction to implicit partial di¤erential equations of the rst order
We will discuss here Dirichlet problems for non linear rst order partial di¤erential equations. We will present the recent results of DacorognaMarcellini on this subject; mentioning briey, as a matter of introduction, some results on viscosity solutions.
متن کاملHermite form computation of matrices of di erential polynomials
Given a matrix A ∈ F(t)[D; δ]n×n over the ring of di erential polynomials, we rst prove the existence of the Hermite form H of A over this ring. Then we determine degree bounds on U and H such that UA = H. Finally, based on the degree bounds on U and H, we compute the Hermite form H of A by reducing the problem to solving a linear system of equations over F(t). The algorithm requires a polynomi...
متن کامل